Structure Constraints in a Constraint-Based Planner
نویسندگان
چکیده
In this paper we report our work on a new constraint domain, where variables can take structured values. Earth-science data processing (ESDP) is a planning domain that requires the ability to represent and reason about complex constraints over structured data, such as satellite images. This paper reports on a constraint-based planner for ESDP and similar domains. We discuss our approach for translating a planning problem into a constraint satisfaction problem (CSP) and for representing and reasoning about structured objects and constraints over
منابع مشابه
Subgoal Partitioning and Resolution in SGPlan∗
In this demo, we illustrate the idea and operations of SGPlan (Chen, Hsu, & Wah 2004; Wah & Chen 2005), a PDDL2.2 planner that won the first prize in the suboptimal temporal metric track and a second prize in the suboptimal propositional track in the Fourth International Planning Competition (IPC4), 2004. SGPlan is the only planner that won in two tracks of the competition. Since SGPlan is a su...
متن کاملتدارک همزمان انرژی و ذخیره کنترل فرکانس اولیه بادرنظرگرفتن محدودیت گرفتگی خطوط
The simultaneous scheduling of energy and primary reserve is one of most important recent researches. However, in these researches, operation constraints and transmission limitations have been neglected. So it is possible that the power flow results be infeasible since some real constraints are not considered. In this paper congestion constraint in transmission lines, technical capabilities and...
متن کاملEncoding Domain Transitions for Constraint-Based Planning
We describe a constraint-based automated planner named Transition Constraints for Parallel Planning (TCPP). TCPP constructs its constraint model from a redefined version of the domain transition graphs (DTG) of a given planning problem. TCPP encodes state transitions in the redefined DTGs by using table constraints with cells containing don’t cares or wild cards. TCPP uses Minion the constraint...
متن کاملConstraint-Based Envelopes over Multiple Alternatives
Many real-world planning problems require sophisticated reasoning about numeric resources, including sharing of resources by different actions. Constraintbased planners offer machinery to represent complex constraints and dependencies between actions. However, such planners usually consider a single partial plan at a time, and limit themselves with finding a feasible solution. Alternatively, pl...
متن کاملProcesses and Continuous Change in a SAT - based Planner 1 Ji - Ae Shin
The TM-LPSAT planner can construct plans in domains containing atomic actions and durative actions; events and processes; discrete, real-valued, and interval-valued fluents; reusable resources, both numeric and interval-valued; and continuous linear change to quantities. It works in three stages. In the first stage, a representation of the domain and problem in an extended version of PDDL+ is c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004